Quantum search algorithms on the hypercube
نویسندگان
چکیده
منابع مشابه
Quantum search algorithms on the hypercube
We investigate a set of discrete-time quantum search algorithms on the n-dimensional hypercube following a proposal by Shenvi, Kempe and Whaley [1]. We show that there exists a whole class of quantum search algorithms in the symmetry reduced space which perform a search of a marked vertex in time of order √ N where N = 2, the number of vertices. In analogy to Grover’s algorithm, the spatial sea...
متن کاملQuantum Walks on the Hypercube
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time. In both cases we show that the quantum walk mixes in (π/4)n steps, faster than the Θ...
متن کاملQuantum Mechanics on the Hypercube
We construct quantum evolution operators on the space of states, that is represented by the vertices of the n-dimensional unit hypercube. They realize the metaplectic representation of the modular group SL(2,Z2n). By construction this representation acts in a natural way on the coordinates of the non-commutative 2torus, T2 and thus is relevant for noncommutative field theories as well as theori...
متن کاملNonadiabatic quantum search algorithms
We present two continuous-time quantum search algorithms similar to the adiabatic search algorithm, but now without the requirement of adiabatic evolution. Both algorithms can find the marked state in a time proportional to N. The behavior of the first algorithm is, essentially, similar to Grover’s algorithm, but the second model possesses the important property that one does not need to single...
متن کاملDivide-and-Conquer Algorithms on the Hypercube
We show how to implement divide-and-conquer algorithms without undue overhead on a wide class of networks. We give an optimal generic divide-and-conquer implementation on hypercubes for the class of divide-and-conquer algorithms for which the total size of the subproblems on any level of the recursion does not exceed the parent problem size. For this implementation, appropriately sized subcubes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2009
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/42/8/085303